Moderately Exponential Time Algorithms Dagstuhl Seminar
نویسندگان
چکیده
From 19/10/2008 to 24/10/2008, the Dagstuhl Seminar 08431 Moderately Exponential Time Algorithms was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)
This report documents the program and the outcomes of Dagstuhl Seminar 13331 “Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time”. Problems are often solved in practice by algorithms with worst-case exponential time complexity. It is of interest to find the fastest algorithms for a given problem, be it polynomial, exponential, or something in between. The focus of the semi...
متن کاملSparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251)
Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241) Britta Dorn, Nicolas Maudet, and Vincent Merlin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242) Peter Bürgisser, Felipe Cucker, Marek Karpinski, and Nicolai Vorobjov . . . . . . . . . . 28 Sparse Modelling and Multi-exponential An...
متن کاملBidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)
We provide a report on the Dagstuhl Seminar 13121: Bidimensional Structures: Algorithms, Combinatorics and Logic held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013. The report contains the motivation of the seminar, the abstracts of the talks given during the seminar, and the list of open problems. Seminar 18.–22. March, 2013 – www.dagstuhl.de/13121 1998 A...
متن کاملGeosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492)
Computational Mass Spectrometry (Dagstuhl Seminar 13491) Ruedi Aebersold, Oliver Kohlbacher, and Olga Vitek . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Geosensor Networks: Bridging Algorithms and Applications (Dagstuhl Seminar 13492) Matt Duckham, Stefan Dulman, Jörg-Rüdiger Sack, and Monika Sester . . . . . . . . . . 17 Approaches and Applications of Inductive Programming (Da...
متن کاملAlgorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)
From 20.09.09 to 25.09.09, the Dagstuhl Seminar 09391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar are put together in this paper. ...
متن کامل